Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
نویسنده
چکیده
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected components. We present an algorithm for this problem which runs in strongly polynomial-time if both the specified number of connected components and the maximum size of hyperedges in the hypergraph are constants. Our algorithm extends the algorithm due to Thorup (2008) for computing minimum multiway cuts of graphs from greedy packings of spanning trees.
منابع مشابه
A Backtracking-Based Algorithm for Computing Hypertree-Decompositions
Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertreewidth is a measure for the cyclicity and therefore tractability of the encoded computation problem. Many NP-hard decision and computation problems are known to be tractable on instances whose structure corresponds to hypergraphs of bounded hypertree-width. Intuitively, the s...
متن کاملTree-Related Widths of Graphs and Hypergraphs
A hypergraph pair is a pair (G,H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] from hypergraphs to hypergraph pairs. We show that for constant k the problem of deciding whether a hypergraph pair has generalised hypertree-width ≤ k, is equivalent to the Hypergraph Sandwich Problem (HSP) [13]. It wa...
متن کاملHypertree-depth and minors in hypergraphs
We introduce two new notions for hypergraphs, hypertree-depth and minors in hypergraphs. We characterise hypergraphs of bounded hypertree-depth by the ultramonotone robber and marshals game, by vertex-hyperrankings and by centred hypercolourings. Furthermore, we show that minors in hypergraphs are ‘well-behaved’ with respect to hypertree-depth and other hypergraph invariants, such as generalise...
متن کاملComputing minimum cuts in hypergraphs
We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph H = (V, E) with n= |V |, m= |E| and p = ∑ e∈E |e| the fastest known algorithm to compute a global minimum cut in H runs in O(np) time for the uncapacitated case, and in O(np+ n2 log n) time for the capacitated case. We show the following new results. • Given an uncapacitated hypergraph H and an intege...
متن کاملApproximating Width Parameters of Hypergraphs with Excluded Minors
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx, who introduced the fractional hypertree width of a hypergraph. All these width parameters on hypergraphs are useful for extending the tractability of many problems in dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010